Search by lackadaisical quantum walk with symmetry breaking

Symmetry Breaking by Metaheuristic Search

Several methods exist for breaking symmetry in constraint problems, but most potentially suffer from high memory requirements, high computational overhead, or both. We describe a new partial symmetry breaking method that can be applied to arbitrary variable/value symmetries. It models dominance detection as a nonstationary optimisation problem, and solves it by resource-bounded metaheuristic se...

Symmetry Breaking by Local Search

The presence of symmetry in constraint satisfaction problems can cause a great deal of wasted search effort, and several methods for breaking symmetries have been reported. We describe a new approach to partial symmetry breaking: using local search in the symmetry group to detect violated lex-leader constraints. The local search is interleaved with the backtrack search performed by the constrai...

Boosting Partial Symmetry Breaking by Local Search

S. D. Prestwich, B. Hnich, H. Simonis, R. Rossi, and S. A. Tarim Cork Constraint Computation Centre, University College Cork, Ireland Faculty of Computer Science, Izmir University of Economics, Turkey Logistics, Decision and Information Sciences Group, Wageningen UR, the Netherlands Operations Management Division, Nottingham University Business School, Nottingham, UK [email protected], brah...

Quantum measurement driven by spontaneous symmetry breaking

The measurement process in quantum mechanics is usually described by the von Neumann projection postulate, which forms a basic constituent of the laws of quantum mechanics. Since this postulate requires the outside observer of the system, it is hard to apply quantum mechanics to the whole Universe. Therefore we propose that the quantum measurement process is actually a physical process associat...

Search via Quantum Walk